C-FOREST: Parallel Shortest Path Planning With Superlinear Speedup

Superlinear Speedup in Parallel Computation

Speedup of a parallel computation is defined as Sp = T/Tp [2], where T is the sequential time of a problem and Tp is the parallel time to solve the same problem using p processors. Tp was argued to be no greater than P in [3]. However, in practice, people observed “superlinear speedup”, i.e. the speedup with P processors is greater than P. Two main reasons for superlinear speedup are shown in [...

Superlinear Speedup in Parallel State-Space Search

When N processors perform depth-first search on-disjoint parts of a state space tree to find a solution, the speedup can be superlinear (i.e., > N) or sublinear (i.e., < N) depending upon when a solution is first encountered in the space by one of the processors. It may appear that on the average, the speedup would be either linear or sublinear. Using an analytical model, we show that if the se...

Direction Weighted Shortest Path Planning

Parallel Shortest Path Auction Algorithmsl

In this paper we discuss the parallel implementation of the auction algorithm for shortest path problems. We show that both the one-sided and the two-sided versions of the algorithm admit asynchronous implementations. We implemented the parallel schemes for the algorithm on a shared memory machine and tested its efficiency under various degrees of synchronization and for different types of prob...

Superlinear Speedup by Program Transformation (Extended Abstract)